Faster gossiping on butterfliesSIBEYN, Jop F.Lecture notes in computer science. 2001, pp 785-796, issn 0302-9743, isbn 3-540-42287-0Conference Paper

The spectra of wrapped butterfly digraphsCOMELLAS, Francesc; FIOL, Miquel Angel; GIMBERT, Joan et al.Networks (New York, NY). 2003, Vol 42, Num 1, pp 15-19, issn 0028-3045, 5 p.Article

4-Systolic broadcasting in a wrapped butterfly networkNARAYANASWAMY, Ganesh; SHENDE, Anil M; VIPRANARAYANAN, Praveen et al.Lecture notes in computer science. 2002, pp 98-107, issn 0302-9743, isbn 3-540-00355-X, 10 p.Conference Paper

Layouts for Sparse Networks Supporting Throughput ComputingLEPPÄNEN, Ville; PENTTONEN, Martti; FORSELL, Martti et al.Parallel and distributed processing techniques and applications. International conferenceWorldComp'2010. 2010, pp 443-449, isbn 1-60132-156-2 1-60132-157-0 1-60132-158-9, 7 p.Conference Paper

Parallel algorithms for hierarchical clusteringOLSON, C. F.Parallel computing. 1995, Vol 21, Num 8, pp 1313-1325, issn 0167-8191Article

Edge-disjoint spanning trees for the generalized butterfly networks and their applicationsTOUZENE, Abderezak; DAY, Khaled; MONIEN, Burkhard et al.Journal of parallel and distributed computing (Print). 2005, Vol 65, Num 11, pp 1384-1396, issn 0743-7315, 13 p.Article

Leader election in hyper-butterfly graphsWEI SHI; SRIMANI, Pradip K.Lecture notes in computer science. 2004, pp 292-299, issn 0302-9743, isbn 3-540-23388-1, 8 p.Conference Paper

Randomized routing with shorter pathsUPFAL, E; FELPERIN, S; SNIR, M et al.IEEE transactions on parallel and distributed systems. 1996, Vol 7, Num 4, pp 356-362, issn 1045-9219Article

Embedding iterated line digraphs in booksHASUNUMA, Toru.Networks (New York, NY). 2002, Vol 40, Num 2, pp 51-62, issn 0028-3045Article

Cyclic-cubes and wrap-around butterfliesWAGH, M. D; MATH, P; GUZIDE, O et al.Information processing letters. 2000, Vol 75, Num 1-2, pp 25-27, issn 0020-0190Article

Mapping cycles and trees on wrap-around butterfly graphsWAGH, Meghanad D; GUZIDE, Osman.SIAM journal on computing (Print). 2006, Vol 35, Num 3, pp 741-765, issn 0097-5397, 25 p.Article

The Forwarding Indices of Wrapped Butterfly NetworksXINMIN HOU; XU, Jun-Ming; MIN XU et al.Networks (New York, NY). 2009, Vol 53, Num 4, pp 329-333, issn 0028-3045, 5 p.Article

Design of an asynchronous switch based on butterfly fat-tree for network-on-chip applicationsKANG, Min-Chang; JUNG, Eun-Gu; HAR, Dong-Soo et al.Lecture notes in computer science. 2005, issn 0302-9743, isbn 3-540-30027-9, 2Vol, Part II, 538-549Conference Paper

Ulysses: a robust, low-diameter, low-latency peer-to-peer networkKUMAR, Abhishek; MERUGU, Shashidhar; JIM, Jun et al.European transactions on telecommunications. 2004, Vol 15, Num 6, pp 571-587, issn 1124-318X, 17 p.Article

Yet another meta-language for programming language processingHAIMING CHEN; YUNMEI DONG.ACM SIGPLAN notices. 2002, Vol 37, Num 6, pp 28-37, issn 1523-2867Article

Coverings that preserve sense of directionBOLDI, P; VIGNA, S.Information processing letters. 2000, Vol 75, Num 4, pp 175-180, issn 0020-0190Article

On the average case circuit delay of disjunctionBOLLIG, B; HÜHNE, M; PÖLT, S et al.Parallel processing letters. 1995, Vol 5, Num 2, pp 275-280, issn 0129-6264Article

Faster gossiping on butterfly networksSIBEYN, Jop F.Theoretical computer science. 2005, Vol 331, Num 1, pp 53-72, issn 0304-3975, 20 p.Conference Paper

Cycle embedding in faulty wrapped butterfly graphsTSAI, Chang-Hsiung; TYNE LIANG; HSU, Lih-Hsing et al.Networks (New York, NY). 2003, Vol 42, Num 2, pp 85-96, issn 0028-3045, 12 p.Article

Optimal three-dimensional layout of interconnection networksCALAMONERI, Tiziana; MASSINI, Annalisa.Theoretical computer science. 2001, Vol 255, Num 1-2, pp 263-279, issn 0304-3975Article

Design-for-testability and fault-tolerant techniques for FFT processorsLU, Shyue-Kung; SHIH, Jen-Sheng; HUANG, Shih-Chang et al.IEEE transactions on very large scale integration (VLSI) systems. 2005, Vol 13, Num 6, pp 732-741, issn 1063-8210, 10 p.Article

A Contention-Free Parallel Access by Butterfly Networks for Turbo InterleaversNIEMINEN, Esko.IEEE transactions on information theory. 2014, Vol 60, Num 1, pp 237-251, issn 0018-9448, 15 p.Article

Ranks of graphs : The size of acyclic orientation cover for deadlock-free packet routingKRALOVIC, R; RUZICKA, P.Theoretical computer science. 2007, Vol 374, Num 1-3, pp 203-213, issn 0304-3975, 11 p.Article

Efficient matrix preconditioners for black box linear algebraLI CHEN; EBERLY, Wayne; KALTOFEN, Erich et al.Linear algebra and its applications. 2002, Vol 343-44, pp 119-146, issn 0024-3795Article

Median bounds and their applicationSIEGEL, Alan.Journal of algorithms (Print). 2001, Vol 38, Num 1, pp 184-236, issn 0196-6774Conference Paper